Convex separable minimization problems with a linear constraint and bounded variables
نویسندگان
چکیده
منابع مشابه
Convex separable minimization problems with a linear constraint and bounded variables
Consider the minimization problem with a convex separable objective function over a feasible region defined by linear equality constraint(s)/linear inequality constraint of the form “greater than or equal to” and bounds on the variables. A necessary and sufficient condition and a sufficient condition are proved for a feasible solution to be an optimal solution to these two problems, respectivel...
متن کاملMinimization of a Convex Linear-Fractional Separable Function Subject to a Convex Inequality Constraint or Linear Inequality Constraint and Bounds on the Variables
We consider the problem of minimizing a convex linear-fractional separable function over a feasible region defined by a convex inequality constraint or linear inequality constraint, and bounds on the variables (box constraints). These problems are interesting from both theoretical and practical points of view because they arise in somemathematical programming problems and in various practical p...
متن کاملConvex minimization problems with weak constraint qualifications
One revisits the standard saddle-point method based on conjugate duality for solving convex minimization problems. Our aim is to reduce or remove unnecessary topological restrictions on the constraint set. Dual equalities and characterizations of the minimizers are obtained with weak or without constraint qualifications. The main idea is to work with intrinsic topologies which reflect some geom...
متن کاملMinimization of a strictly convex separable function subject to a convex inequality constraint or linear equality constraints and bounds on the variables
In this paper, we consider the problem of minimizing a strictly convex separable function over a feasible region defined by a convex inequality constraint and two-sided bounds on the variables (box constraints). Also, the convex separable program with a strictly convex objective function subject to linear equality constraints and bounded variables is considered. These problems are interesting f...
متن کاملSeparable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum point in a finite number of steps is described. The optimum value is shown to be monotone with respect to a partial order on the constraint parameters. More...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2005
ISSN: 0161-1712,1687-0425
DOI: 10.1155/ijmms.2005.1339